Lossless abstraction of imperfect information games
نویسندگان
چکیده
منابع مشابه
Automated Action Abstraction of Imperfect Information Extensive-Form Games
Multi-agent decision problems can often be formulated as extensive-form games. We focus on imperfect information extensive-form games in which one or more actions at many decision points have an associated continuous or manyvalued parameter. A stock trading agent, in addition to deciding whether to buy or not, must decide how much to buy. In no-limit poker, in addition to selecting a probabilit...
متن کاملPotential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games
There is often a large disparity between the size of a game we wish to solve and the size of the largest instances solvable by the best algorithms; for example, a popular variant of poker has about 10 nodes in its game tree, while the currently best approximate equilibrium-finding algorithms scale to games with around 10 nodes. In order to approximate equilibrium strategies in these games, the ...
متن کاملGames with Imperfect Information
An information set in a game tree is a set of nodes from which the rules of the game require that the same alternative (i.e., move) be selected. Thus the nodes an information set are indistinguishable to the player moving from that set, thereby reflecting imperfect information, that is, information hidden from that player. Information sets arise naturally in (for example) card gaines like poker...
متن کاملExpectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker
Automated abstraction algorithms for sequential imperfect information games have recently emerged as a key component in developing competitive game theory-based agents. The existing literature has not investigated the relative performance of different abstraction algorithms. Instead, agents whose construction has used automated abstraction have only been compared under confounding effects: diff...
متن کاملStrategic Planning for Imperfect - Information Games Stephen
Although game-tree search works well in perfect-information games, there are problems in trying to use it for imperfect-information games such as bridge. The lack of knowledge about the oppo-nents' possible moves gives the game tree a very large branching factor, making the tree so immense that game-tree searching is infeasible. In this paper, we describe our approach for overcoming this proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2007
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1284320.1284324